Power Sum Decompositions of Defining Equations of Reflection Arrangements
نویسنده
چکیده
We determine the Waring rank and a Waring decomposition of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups. Given a homogeneous polynomial f of degree d, the Waring rank of f , denoted r(f), is the smallest positive integer r such that there exist linear forms l1, . . . , lr with f = l d 1+· · ·+lr , and a Waring decomposition is such an expression with length r = r(f). For example, xy = 1 4 ((x+ y) − (x− y)), so r(xy) ≤ 2, and
منابع مشابه
Solving System of Linear Congruence Equations over some Rings by Decompositions of Modules
In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...
متن کاملDefining Equations of Subspace Arrangements Embedded in Reflection Arrangements
We give explicit generators for ideals of two classes of subspace arrangements embedded in certain reflection arrangements, generalizing results of Li-Li and Kleitman-Lovasz. We also give minimal generators for the ideals of arrangements that arise in a natural way from the p-skeleton of an n-dimensional cube and discuss conditions under which the generators that we give form Gröbner bases
متن کاملReliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملA Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
We show that the k-SUM problem can be solved by a linear decision tree of depth O(n2 log2 n), improving the recent bound O(n3 log3 n) of Cardinal et al. [7]. Our bound depends linearly on k, and allows us to conclude that the number of linear queries required to decide the n-dimensional Knapsack or SubsetSum problems is only O(n3 logn), improving the currently best known bounds by a factor of n...
متن کاملCharacter Sums Associated to Finite Coxeter Groups
The main result of this paper is a character sum identity for Coxeter arrangements over finite fields which is an analogue of Macdonald’s conjecture [19] proved by Opdam [21]. 0. Introduction Throughout this paper F will denote a finite field of characteristic p different from 2. We first slightly reformulate Macdonald’s conjecture in a form which has a direct analogue over F. Let G be a finite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014